//
// Created by Castle-Moriarty on 2025/10/31.
//

#include <iostream>
using namespace std;

int main() {
    // 倒序斐波那契数列
    int a[30] ={0,0,1};
    for (int i = 3;i <= 20;i++) {
        a[i] = a[i - 1] + a[i - 2];
    }
    // 逆序输出
    for (int i = 20;i >= 1;i--) {
        cout << a[i] << endl;
    }
    return 0;
}